Cograph generation with linear delay
نویسندگان
چکیده
منابع مشابه
Cograph generation with linear delay
Cographs have always been a research target in areas such as coloring, graph decomposition, and spectral theory. In this work, we present an algorithm to generate all unlabeled cographs with n vertices, based on the generation of cotrees. The delay of our algorithm (time spent between two consecutive outputs) is O(n). The time needed to generate the first output is also O(n), which gives an ove...
متن کاملA Simple Linear Time LexBFS Cograph Recognition Algorithm
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for various families of graphs. In this paper, we add to this work by producing a simple two LexBFS sweep algorithm to recognize the family of cographs. This algorithm extends to other related graph families such as P4-red...
متن کاملA simple linear time algorithm for cograph recognition
In this paper, we describe a new simple linear time algorithm to recognize cographs. Cographs are exactly the P4-free graphs (where P4 denotes the path with 4 vertices). The recognition process works in two steps. First, we use partition refinement techniques to produce a factorizing permutation, i.e., an ordering of the vertices in which the strong modules appear consecutively. Then a very sim...
متن کاملComputing and extracting minimal cograph completions in linear time ∗
A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we characterize minimal cograph completions, and we give the following linear-time algorithms: one for extracting a minimal cograph completion from any given cograph completion of G, and one for d...
متن کاملParallel Algorithm for Cograph Recognition with Applications
We present a parallel algorithm for recognizing cographs and constructing their cotrees. The algorithm takes O(log 2 n) time with O(n + m) processors on a CRCW PRAM, where n and m are the number of vertices and edges of the graph. Using cotree representation, we obtain parallel algorithms for solving the maximum matching and the permutation representation problems for cographs using O(logn) tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.12.037